Higher-rank numerical ranges and compression problems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Higher-rank Numerical Ranges and Compression Problems

We consider higher-rank versions of the standard numerical range for matrices. A central motivation for this investigation comes from quantum error correction. We develop the basic structure theory for the higher-rank numerical ranges, and give a complete description in the Hermitian case. We also consider associated projection compression problems.

متن کامل

Higher rank numerical ranges of rectangular matrix polynomials

In this paper, the notion of rank-k numerical range of rectangular complex matrix polynomials are introduced. Some algebraic and geometrical properties are investigated. Moreover, for ϵ > 0; the notion of Birkhoff-James approximate orthogonality sets for ϵ-higher rank numerical ranges of rectangular matrix polynomials is also introduced and studied. The proposed denitions yield a natural genera...

متن کامل

Higher-rank Numerical Ranges and Dilations

For any n-by-n complex matrix A and any k, 1 ≤ k ≤ n, let Λk(A) = {λ ∈ C : X∗AX = λIk for some n-by-k X satisfying X∗X = Ik} be its rank-k numerical range. It is shown that if A is an n-by-n contraction, then Λk(A) = ∩{Λk(U) : U is an (n + dA)-by-(n + dA) unitary dilation of A}, where dA = rank (In − A∗A). This extends and refines previous results of Choi and Li on constrained unitary dilations...

متن کامل

Higher Rank Numerical Ranges of Normal Matrices

The higher rank numerical range is closely connected to the construction of quantum error correction code for a noisy quantum channel. It is known that if a normal matrix A ∈ Mn has eigenvalues a1, . . . , an, then its higher rank numerical range Λk(A) is the intersection of convex polygons with vertices aj1 , . . . , ajn−k+1 , where 1 ≤ j1 < · · · < jn−k+1 ≤ n. In this paper, it is shown that ...

متن کامل

Higher–rank Numerical Ranges of Unitary and Normal Matrices

We verify a conjecture on the structure of higher-rank numerical ranges for a wide class of unitary and normal matrices. Using analytic and geometric techniques, we show precisely how the higher-rank numerical ranges for a generic unitary matrix are given by complex polygons determined by the spectral structure of the matrix. We discuss applications of the results to quantum error correction, s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 2006

ISSN: 0024-3795

DOI: 10.1016/j.laa.2006.03.019